Discrete Wavelet Analysis for Fast Optic Flow Computation

Discrete Wavelet Analysis for Fast Optic Flow Computation

This paper describes a new way to compute the optic flow, based on a discrete wavelet basis analysis. The optic flow is estimated locally by the projection of the differential optic flow equation onto wavelets. The resulting linear systems are small and of fixed size (3-5 equations). They are solved to find out the visual displacement. In this way, we circumvent the classical problems of time a...

Fast Optic Flow Computation with Discrete Wavelets

This paper describes a new way to compute the optical ow based on dyadic ltering and subsampling pyramids. It is based on the projection of the optical ow equation on vectors of a wavelet basis. This algorithm is thus of complexity O(N) if one image of the sequence has N pixels, and opens the way to eecient and unexpensive optical ow computation. Features of this algorithm include multiscale tr...

Fast Algorithms for Wavelet Transform Computation

Fast computation of adaptive wavelet expansions

In this paper we describe and analyze an algorithm for the fast computation of sparse wavelet coefficient arrays typically arising in adaptive wavelet solvers. The scheme improves on an earlier version from [17] in several respects motivated by recent developments of adaptive wavelet schemes. The new structure of the scheme is shown to enhance its performance while a completely different approa...

Fast Computation of the Gabor Wavelet Transform

The Gabor filter is a valuable tool in computer vision, however, its high computational load precludes its use in many applications. This paper presents a novel method for approximating Gabor wavelets with a function that can be convolved more efficiently in the spatial domain. The method extends the well known separable nature of the Gabor filter, and demonstrates a means for reducing the comp...